Shortest path problem - PDFSEARCH.IO - Document Search Engine

Shortest path problem
Results: 829

#	Item
471	Scotch and libScotch 4.0 User’s Guide∗ Fran¸cois Pellegrini ScAlApplix project, INRIA Futurs ENSEIRB & LaBRI, UMR CNRS 5800 Universit´e Bordeaux I 351 cours de la Lib´eration, 33405 TALENCE, FRANCE Add to Reading List Source URL: www.labri.fr Language: English - Date: 2007-08-08 05:02:28 NP-complete problems Shortest path problem Tree Graph Graph theory Theoretical computer science Mathematics
472	Microsoft Word - simOpt#7.docx Add to Reading List Source URL: www.stegger.net Language: English - Date: 2013-05-31 06:14:44 Network theory Applied mathematics Shortest path problem Simulation Mathematical optimization Operations research Mathematics Theoretical computer science
473	VF2x: Fast, efficient virtual network mapping for real testbed workloads Qin Yin and Timothy Roscoe Systems Group, ETH Zürich, Universitätstrasse 6, CH 8092, Zürich, {qyin,troscoe}@inf.ethz.ch Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2014-09-30 10:30:55 Network topology Topology Shortest path problem Node Network mapping Heuristic function Mathematics Theoretical computer science Electronics
474	Scotch and libScotch 5.1 User’s Guide (version[removed]Fran¸cois Pellegrini Bacchus team, INRIA Bordeaux Sud-Ouest IPB & LaBRI, UMR CNRS 5800 Add to Reading List Source URL: gforge.inria.fr Language: English NP-complete problems Scotch Shortest path problem Graph partition Algorithm Nested dissection Graph Mathematics Theoretical computer science Graph theory
475	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics
476	Network Routing with Path Vector Protocols: Theory and Applications Joao ˜ Lu´ıs Sobrinho Instituto de Telecomunicac¸oes, ˜ Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:28 Routing protocols Theoretical computer science Routing Distance-vector routing protocol Link-state routing protocol Shortest path problem Monotonic function IEEE 802.1aq Multipath routing Routing algorithms Mathematics Mathematical analysis
477	Reading The Web with Learned Syntactic-Semantic Inference Rules Ni Lao1∗, Amarnag Subramanya2 , Fernando Pereira2 , William W. Cohen1 Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA 2 Google Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2012-06-18 14:25:33 Freebase Shortest path problem Graph database FO Relational model Graph Theoretical computer science Mathematics Graph theory
478	Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh Department of Computer Science Texas A&M University College Station, Add to Reading List Source URL: conferences.sigcomm.org Language: English - Date: 2003-07-24 11:26:27 Graph Chordal graph Shortest path problem Induced path Distributed hash table Tree Moore graph Networks Koorde Graph theory Network theory Distributed data storage
479	Route Planning in Transportation Networks HANNAH BAST University of Freiburg DANIEL DELLING Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-01-08 16:25:56 Routing algorithms Network theory Shortest path problem Distance Bellman–Ford algorithm Graph Centrality Floyd–Warshall algorithm Shortest path tree Mathematics Graph theory Theoretical computer science
480	SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for Add to Reading List Source URL: siam.org Language: English - Date: 2013-09-19 09:13:08 NP-complete problems Approximation algorithm Submodular set function Shortest path problem Bin packing problem Vertex cover Dominating set Independent set Computational complexity theory Theoretical computer science Graph theory Mathematics

UPDATE